Hardening the elgamal cryptosystem in the setting of the second group of units

The ElGamal encryption scheme is best described in the setting of any finite cyclic group. Its classic case is typically presented in the multiplicative group of the ring of integers modulo a prime p and the multiplicative groups * 2m F of finite fields of characteristic two. The ElGamal cryptosystem was modified to deal with Gaussian integers, and extended to work with group of units of / . In this paper, we consider yet another extension to the ElGamal cryptosystem employing the second group of units of and the second group of units of / , where h(x) is an irreducible polynomial. We describe the arithmetic needed in the new setting, and present examples, proofs and algorithms to illustrate the applicability of the proposed scheme. We implement our algorithms and conduct testing to evaluate the accuracy, efficiency and security of the modified cryptographic scheme.